Resilience in Discrete Event Systems

This paper explores the notion of resilience a fault in DES, as ability to spontaneously return normal behavior, without leaking information about this occurrence an external observer. Resilience expresses some form insensitivity or robustness, related but different from classical notions like diagnosability opacity. Different definitions are examined, expressed terms recovery points language relations. It is shown that verifying PSPACE-complete. However, complexity reduces PTIME for recently introduced history deterministic automata, sub-class NFA. We examine detail instructive pathway reduction, which could be instrumental reduction other DES problems.